Transductive Ranking on Graphs
نویسنده
چکیده
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or ordering over the object space. We consider the problem of learning such a ranking function in a transductive, graph-based setting, where the object space is finite and is represented as a graph in which vertices correspond to objects and edges encode similarities between objects. Building on recent developments in regularization theory for graphs and corresponding Laplacian-based learning methods, we develop an algorithmic framework for learning ranking functions on graphs. We derive generalization bounds for our algorithms in transductive models similar to those used to study other transductive learning problems, and give experimental evidence of the potential benefits of our framework.
منابع مشابه
Half Transductive Ranking
We study the standard retrieval task of ranking a fixed set of documents given a previously unseen query and pose it as the half-transductive ranking problem. The task is partly transductive as the document set is fixed. Existing transductive approaches are natural non-linear methods for this set, but have no direct out-ofsample extension. Functional approaches, on the other hand, can be applie...
متن کاملAdvances in Ranking
We study the standard retrieval task of ranking a fixed set of documents given a previously unseen query and pose it as the half-transductive ranking problem. The task is partly transductive as the document set is fixed. Existing transductive approaches are natural non-linear methods for this set, but have no direct out-ofsample extension. Functional approaches, on the other hand, can be applie...
متن کاملSemidefinite Ranking on Graphs
Semidefinite Ranking on Graphs Shankar Vembu, Thomas Gärtner, and Stefan Wrobel 1 Fraunhofer IAIS, Schloß Birlinghoven, 53754 Sankt Augustin, Germany 2 Department of Computer Science III, University of Bonn, Germany {shankar.vembu, thomas.gaertner, stefan.wrobel}@iais.fraunhofer.de We consider the problem of ranking the vertices of an undirected graph given some preference relation. Without inc...
متن کاملA Scalable Graph-Based Semi-Supervised Ranking System for Content-Based Image Retrieval
The authors propose a scalable graph-based semi-supervised ranking system for image retrieval. This system exploits the synergism between relevance feedback based transductive short-term learning and semantic feature-based long-term learning to improve retrieval performance. Active learning is applied to build a dynamic feedback log to extract semantic features of images. Two-layer manifold gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008